Implementation of K-shortest Path Algorithm in GPU Using CUDA
نویسندگان
چکیده
منابع مشابه
Efficient Parallel Implementation of Single Source Shortest Path Algorithm on GPU Using CUDA
In today‟s world there are number of applications like routing in telephone networks, traveller information system, robotic path selection etc., where data can be represented as a graph and different graph algorithms are executed on it to fulfil the requirements of the application. Data related to these applications are growing every day, but we still need quick and real time responses from the...
متن کاملImplementation of String Match Algorithm BMH on GPU Using CUDA
String match algorithm is widely used in the area of data mining. In this paper, we present an approach for elevating the performance of this algorithm via GPU (Graphic Processing Unit). With the rapid development of Graphics Processing Unit to many-core multiprocessors, it shows great potential in many applications and high performance computing. Especially, the heterogeneous architecture CPU+...
متن کاملACL2 Meets the GPU: Formalizing a CUDA-based Parallelizable All-Pairs Shortest Path Algorithm in ACL2
As Graphics Processing Units (GPUs) have gained in capability and GPU development environments have matured, developers are increasingly turning to the GPU to off-load the main host CPU of numerically-intensive, parallelizable computations. Modern GPUs feature hundreds of cores, and offer programming niceties such as double-precision floating point, and even limited recursion. This shift from C...
متن کاملParallel Implementation of Similarity Measures on GPU Architecture using CUDA
Image processing and pattern recognition algorithms take more time for execution on a single core processor. Graphics Processing Unit (GPU) is more popular now-a-days due to their speed, programmability, low cost and more inbuilt execution cores in it. Most of the researchers started work to use GPUs as a processing unit with a single core computer system to speedup execution of algorithms and ...
متن کاملThe Application of K–Shortest Path Algorithm in Multicast Routing
Abstract. There have been many heuristic algorithms finding multicast trees proposed over the past few years. The necessity for finding a better and more suitable algorithm is still a current and important challenge. The article presents a new multicast routing algorithm for finding a multicast tree in packet networks. The objective of the K-Shortest Path Multicast Algorithm (KSPMA) is to minim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2015
ISSN: 1877-0509
DOI: 10.1016/j.procs.2015.04.103